Weighted parametric tests defined by graphs
نویسنده
چکیده
This document describes how to use gMCP to construct, conduct and evaluate multiple comparison procedures based on weighted parametric tests which are defined by directed graphs. In addition to sequentially rejective Bonferroni procedures gMCP provides functionality to construct tests that take advantage of (partial) knowledge of the the joint distribution of the p-values associated with multiple hypotheses. For the time being gMCP implements the case of multiple inferences based on one-sided z-tests.
منابع مشابه
AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملOn Symmetry of Some Nano Structures
It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...
متن کاملOptimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate parametric search on
متن کاملScalable Mutual Information Estimation using Dependence Graphs
We propose a unified method for empirical non-parametric estimation of general Mutual Information (MI) func-tion between the random vectors in R based on N i.i.d. samples.The proposed low complexity estimator is based on a bipartitegraph, referred to as dependence graph. The data points aremapped to the vertices of this graph using randomized LocalitySensitive Hashing (L...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کامل